A comparative study of QoS routing schemes that tolerate imprecise state information
نویسندگان
چکیده
In large networks, maintaining precise global network state information is almost impossible. Many factors, including nonnegligible propagation delay, infrequent link state update due to overhead concerns, link state update policy, resource reservation, and hierarchical topology aggregation, have impacts on the precision of the global network state information. To achieve efficient Quality of Service (QoS) routing, a practical routing algorithm must be able to make effective routing decisions in the presence of imprecise global network state information. In this paper, we compare five QoS routing algorithms that were proposed to tolerate imprecise global network state information, safety-based routing, randomized routing, multi-path routing, localized routing, and static multi-path routing. The performance of these routing algorithms are evaluated under two link state update policies, the timer based policy and the threshold based policy. The strengths and limitations of each scheme are identified.
منابع مشابه
A Comparative Study of Quality of Service Routing Schemes That Tolerate Imprecise State Information
In large networks, maintaining precise global network state information is almost impossible. Many factors, including non-negligible propagation delay, infrequent link state update due to overhead concerns, link state update policy, resource reservation, and hierarchical topology aggregation, have impacts on the precision of the global network state information. To achieve efficient Quality of ...
متن کاملDistributed QoS Routing with Imprecise State Information
The goal of Quality-of-Service (QoS) routing is to find a network path which has suficient resources to satisfy certain constraints on delay, bandwidth and/or other metrics. The network state information maintained at every node is often imprecise in a dynamic environment because of nonnegligible propagation delay of state messages, periodic updates due to overhead concern, and hierarchical sta...
متن کاملEmpirical probability based QoS routing
We study Quality-of-Service (QoS) routing schemes that make routing decisions based on empirical resource availability probability information. These empirical probability based routing schemes offer better performance than traditional schemes that make routing decisions based on resource availability information when the global network state information is imprecise. We investigate variations ...
متن کاملA Study of Dynamic Routing and Wavelength Assignment with Imprecise Network State Information
In large networks, maintaining precise global network state information is almost impossible. Many factors, such as non-negligible propagation delay, infrequent state updates due to overhead concerns, and hierarchical topology aggregation, can affect the precision of the global network state information. In this paper, we investigate the impact of imprecise state information on the performance ...
متن کاملDistributed quality-of-service routing in ad hoc networks
In an ad hoc network, all communication is done over wireless media, typically by radio through the air, without the help of wired base stations. Since direct communication is allowed only between adjacent nodes, distant nodes communicate over multiple hops. The quality-of-service (QoS) routing in an ad hoc network is difficult because the network topology may change constantly, and the availab...
متن کامل